منابع مشابه
Unifying Recursion Schemes
Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent such unifications are the ‘recursion schemes from comonads’ of Uustalu, Vene and Pardo, and our own ‘a...
متن کاملRecursion for structured modules
This paper proposes an extension of the ML module system with recursion that keeps a flexible use of nested structures and functors. For the purpose of formal study, we design a calculus, called PathCal, which has a module system with nested structures and simple functors along with recursion. It is important for this calculus to guarantee resolvability of recursive references between modules. ...
متن کاملRecursion Schemes From
Within the setting of the categorical approach to total functional programming, we introduce a \many-in-one" recursion scheme that neatly uniies a variety of seemingly diverging strengthenings of the basic recursion scheme of iteration. The new scheme is doubly generic: in addition to being parametric in a functor capturing the signature of an inductive type, it is also parametric in a comonad ...
متن کاملProgram Schemes, Recursion Schemes, and Formal Languages
This paper presents general methods for studying the problems of translatability between classes of schemes and equivalence of schemes in a given class. There are four methods: applying the theory of formal languages, programming, measuring the complexity of a computation, and "cutting and pasting." These methods are used to answer several questions of translatability and equivalence for classe...
متن کاملUnifying Tree-Decomposition Schemes
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas, such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Subsequently, the paper extends the variable-elimination scheme called bucket-elimination (BE) into a two-phase message passing along a bucket-tree (BTE), mak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2016
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796815000258